Hamilton path decompositions of complete multipartite graphs
نویسندگان
چکیده
منابع مشابه
Fair Hamilton Decompositions of Complete Multipartite Graphs
A fair hamilton decomposition of the complete multipartite graph G is a set of hamilton cycles in G whose edges partition the edges of G in such a way that, for each pair of parts and for each pair of hamilton cycles H1 and H2, the difference in the number of edges in H1 and H2 joining vertices in these two parts is at most one. In this paper we completely settle the existence of such decomposi...
متن کاملHamilton decompositions of balanced complete multipartite graphs with primitive leaves
A graph G is said to be primitive if it contains no proper factors. In this paper, by using the amalgamation technique, we find sufficient conditions for the existence of a d-regular graph G on n vertices which: 1. has a Hamilton decomposition, and 2. has a complement in K p m that is primitive. These general results are then used to consider the bounds onmwhen p and d are fixed. The case p = 6...
متن کاملDecompositions of complete multipartite graphs
This paper answers a recent question of Dobson and Marušič by partitioning the edge set of a complete bipartite graph into two parts, both of which are edge sets of arctransitive graphs, one primitive and the other imprimitive. The first member of the infinite family is the one constructed by Dobson and Marušič.
متن کاملCycle decompositions of complete and complete multipartite graphs
This paper is concerned with the partition of edges of the complete graph Kn and the complete multipartite graph K-m, ... ,-m into subgraphs isomor-phic to cycles. We show that Kn and K-m, ... ,m can be decomposed into certain families of cycles by defining a special decomposition which we call a root path decomposition.
متن کاملHamilton decompositions of complete multipartite graphs with any 2-factor leave
For m ≥ 1 and p ≥ 3, given a set of integers s1, . . . , sq with sj ≥ p + 1 for 1 ≤ j ≤ q and ∑q j=1 sj = mp, necessary and sufficient conditions are found for the existence of a hamilton decomposition of the complete p-partite graph Km,...,m−E(U), where U is a 2-factor of Km,...,m consisting of q cycles, the jth cycle having length sj . This result is then used to completely solve the problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2019
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2018.07.006